Multi-agent Finite-time Ideal Convergence Algorithm Based on Bilinear Manifold
نویسندگان
چکیده
منابع مشابه
Finite-time Flocking of Multi-agent System with Input Saturation
In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...
متن کاملThe fast Convergence Analysis of Finite-time Consensus for Multi-agent with Switching Topology
LI Rui, SHI Yingjing, Sheldon X.-D. Tan 1. School of Automation, University of Electronic Science and Technology of China, Chengdu 611731, P. R. China E-mail: [email protected] 2. Institute of Astronautics and Aeronautics, University of Electronic Science and Technology of China, Chengdu 611731, P. R. China E-mail: [email protected] 3. Department of Electrical Engineering,University of Cal...
متن کاملMulti-Agent Average Convergence
Let I = [0, N − 1] denote the set of indices. We define the set of states S to contain all maps of type I → R for fixed positive N ∈ N (representing the number of agents). For each s ∈ S, i ∈ I, s(i) represents the value held by the agent with ID i. We denote the arbitrarily fixed start state s0. We introduce the function g whose domain MR is the set of non-empty finite multisets of real number...
متن کاملSecond Order Sliding Mode Control With Finite Time Convergence
In this paper, a new smooth second order sliding mode control is proposed. This algorithm is a modified form of Super Twisting algorithm. The Super Twisting guarantees the asymptotic stability, but the finite time stability of proposed method is proved with introducing a new particular Lyapunov function. The Proposed algorithm which is able to control nonlinear systems with matched structured u...
متن کاملConvergence and Rate of Convergence of a Manifold-Based Dimension Reduction Algorithm
We study the convergence and the rate of convergence of a particular manifoldbased learning algorithm: LTSA [12]. The main technical tool is the perturbation analysis on the linear invariant subspace that corresponds to the solution of LTSA. We derive the upper bound for errors under the worst case for LTSA; it naturally leads to a convergence result. We then derive the rate of convergence for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Online Engineering (iJOE)
سال: 2018
ISSN: 1861-2121,1868-1646
DOI: 10.3991/ijoe.v14i04.8364